Remote Control and Monitoring Via Internet on Distributed Data Acquisition

The concept of remote control and monitoring becomes an essential feature in many systems nowadays. Remote control allows clients to control their homes from any places, whereas remote monitoring provides the clients the ability to monitor their home or premises when they are away. The key advantage of this application is client has the ability to control and monitor their home remotely for security and safety reasons. From the analysis have been made, in Malaysia, Internet subscribers are growing rapidly from one year to another. The demand of having remote technology using Internet has made this area favourable, thus, it is chosen to be studied and discussed extensively in this thesis. A method of developing a remote control and monitoring system based on distributed data acquisition using the Internet is established. This system is based on client/server system in which the host computer where the program is installed, is set as a server where static IP address is assigned. For the purpose of control and monitoring tasks, the main program that consists the status of appliances is displayed. It is a user friendly system with good graphical user interface (GUI). The program is developed using the features in LabVIEW version 6i and its Internet Developer Toolkit. The I/O modules attached to the appliances are connected directly to the server via serial port. These I/O modules are based on the concept of data acquisition system (DAQ). The appliances can be controlled from the client PC by browsing the server website. Some necessary data are required to be sent to the server. Once the server is running, monitoring capability is enabled. Generally, this system is part of smart technology that has been developed to increase our quality of life, provide convenience environment and also act as an active partner in managing our busy life. It is a very user-friendly system with good GUI that gives a client an easy working environment. In a nutshell, this system gives a better security for the homes owner by giving them an authority to control and monitor their house from anywhere

A survey on cluster-based routing protocols in wireless sensor networks

In recent years, Wireless Sensor Networks (WSNs) have become interesting for a wide range of applications and a hot research area. Cluster-based routing protocols are more adequate for WSN among different types of routing protocols due to the higher energy utilization rate and being more scalable. In this study, cluster-based routing protocols have been reviewed. In addition, the advantages and objectives of this group of routing protocols are sketched out. Furthermore, several cluster-based routing protocols are analyzed in detail and compared according to the several important metrics. In conclusion, the study is summarized and finalized with some directions for future cluster-based routing protocols

A beacon-enabled least-time and energy efficient with one-level data aggregation routing protocol for WSNs using IEEE 802.15.4

The Wireless Sensor Networks (WSNs) field of research is an interesting topic in the research community these days, because of its applicability in various fields such as civilian and medical research applications. Due to the resources and energy constraints in WSNs, routing can be considered as one of the most important issues in these networks. Every routing protocol designed for WSNs should be reliable, energy-efficient and prolong the network lifetime. This research proposes a beacon-enabled least-time and energy-efficient routing protocol with one-level data-aggregation using an IEEE 802.15.4 which is suitable for Low-Rate Wireless Personal Area Networks as WSNs, because of its low power consuming feature. The proposed protocol is compared to popular ad hoc and WSNs routing protocols i.e., Ad hoc On-Demand Distance Vector, Dynamic Source Routing, Destination-Sequenced Distance Vector routing, Directed Diffusion and Minimum Cost Forwarding. The propose work is simulated using network simulator 2. The simulation results show that the proposed protocol outperformed the routing protocols in the literature in terms of latency, throughput, average energy consumption and average network lifetime

A review on wormhole attacks in MANET

Mobile Ad-hoc Network (MANET) refers to a multi-hop packet based wireless network consist of number of mobile nodes which be able to communicate and move simultaneously, without using any fixed infrastructure. MANET’S are self-organizing networks that can be formed and deformed on the fly. A number of different attacks have been discovered that can be launched against MANETs. Wormhole attackis one such attack that has been recently discovered. Wormhole attack is a very severe and challenging attack because of the fact that it can be launched against any protocol and also due to its ability to be effective in case of encrypted traffic. Enormous amount of work has been done towards the mitigation of wormhole attack and its counter measure. In this paper we have summarize the efforts previously done, our aim here is to provide the researchers a platform where they can find a complete reference to all past work done in regards to the wormhole attack. In the review paper we try to know all the detection techniques and use appropriate one or modify previous related works to have better defense mechanism against wormhole attacks

Impact of blackhole and Sybil attacks on dynamic windows secured implicit geographic forwarding routing protocol

Dynamic windows implicit geographic forwarding (DWSIGF) routing protocol promises a minimal selection on attacker as a hop node. However, it was tested only on blackhole attack with a single optimal attacker. Thus, a thorough investigation was performed to examine whether the protocol is secure against other routing attacks. This study presents a comprehensive analysis of an impact of blackhole and Sybil attacks on the DWSIGF. The analyses on blackhole attack were carried out on a single and multiple attackers using priority selection, random selection, an optimal relay, non-optimal relay, with and without clear to send (CTS) rushing attack. While on the other hand, the Sybil attack's analyses were investigated on the impact of single attacker using optimal and non-optimal relay over increasing traffic loads and growing number of Sybil attackers. The study showed that the DWSIGF promised a superior protection against blackhole/selective forwarding and Sybil attacks with minimum attacker selection and high performance in packet delivery ratio even without inserting any security mechanism in the routing protocol

Comparative study on energy consumption in dynamic window secured implicit geographic forwarding routing protocol

An Ideal WSNs should operate with the least possible energy required in order to increase the lifetime of the sensor nodes and at the same time, ensure network connectivity. But the Inherent power limitation makes power-awareness a critical requirement for WSN, this calls for the need to manage energy in sensor nodes. Also In order to ensure successful transmission of data from sensor node source to destination, it becomes necessary to maintain network availability. The network must be resilient to individual node failure which can happen due to zero power posses by the node and due to security attacks posed on the node and the network. Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol has proven to be robust, efficient and resistant to some security attack which causes failure in network availability. However the extent to which energy is consumed in sensor nodes which deploys DWSIGF as its routing protocol has never been mentioned. In this research, we performed a comparative study on energy consumption in DWSIGF routing protocol. Using the first order radio model, we determined the energy consumed in a network. The protocol (DWSIGF) is matched up against its counterpart SIGF as the traffic is increased. Observation shows that DWSIGF due to the variable timing assigned to the CTS collection window, CTS signal fails to reach destination as collection window time expires, thus the need for retransmission. This in turn consumes more energy than the counterpart SIGF which has a fixed CTS collection time. The simulation work was done using Matlab 7.0. Energy consumed in the random variant of both protocols (DWSIGF and SIGF) was also observed to be higher than the priority variant of the protocols

Agile-SD: A Linux-based TCP Congestion Control Algorithm for Supporting High-speed and Short-distance Networks

Recently, high-speed and short-distance networks are widely deployed and their necessity is rapidly increasing everyday. This type of networks is used in several network applications; such as Local Area Networks (LAN) and Data Center Networks (DCN). In LANs and DCNs, high-speed and short-distance networks are commonly deployed to connect between computing and storage elements in order to provide rapid services. Indeed, the overall performance of such networks is significantly influenced by the Congestion Control Algorithm (CCA) which suffers from the problem of bandwidth under-utilization, especially if the applied buffer regime is very small. In this paper, a novel loss-based CCA tailored for high-speed and Short-Distance (SD) networks, namely Agile-SD, has been proposed. The main contribution of the proposed CCA is to implement the mechanism of agility factor. Further, intensive simulation experiments have been carried out to evaluate the performance of Agile-SD compared to Compound and Cubic which are the default CCAs of the most commonly used operating systems. The results of the simulation experiments show that the proposed CCA outperforms the compared CCAs in terms of average throughput, loss ratio and fairness, especially when a small buffer is applied. Moreover, Agile-SD shows lower sensitivity to the buffer size change and packet error rate variation which increases its efficiency.Comment: 12 Page

Providing Dynamic TXOP for QoS Support of Video Transmission in IEEE 802.11e WLANs

The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe) enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access (HCCA). The scheduler of HCCA allocates Transmission Opportunities (TXOPs) to QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated at the traffic setup time so that it is only efficient for Constant Bit Rate (CBR) applications. However, Variable Bit Rate (VBR) traffics are not efficiently supported as they exhibit nondeterministic profile during the time. In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for supporting the video traffics transmission over IEEE 802.11e wireless networks. This algorithm uses a piggybacked information about the size of the subsequent video frames of the uplink traffic to assist the Hybrid Coordinator accurately assign the TXOP according to the fast changes in the VBR profile. The proposed scheduling algorithm has been evaluated using simulation with different variability level video streams. The simulation results show that the proposed algorithm reduces the delay experienced by VBR traffic streams comparable to HCCA scheduler due to the accurate assignment of the TXOP which preserve the channel time for transmission.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0369

Energy and Spectral Efficiency Balancing Algorithm for Energy Saving in LTE Downlinks

In wireless network communication environments, Spectral Efficiency (SE) and Energy Efficiency (EE) are among the major indicators used for evaluating network performance. However, given the high demand for data rate services and the exponential growth of energy consumption, SE and EE continue to elicit increasing attention in academia and industries. Consequently, a study of the trade-off between these metrics is imperative. In contrast with existing works, this study proposes an efficient SE and EE trade-off algorithm for saving energy in downlink Long Term Evolution (LTE) networks to concurrently optimize SE and EE while considering battery life at the Base Station (BS). The scheme is formulated as a Multi-objective Optimization Problem (MOP) and its Pareto optimal solution is examined. In contrast with other algorithms that prolong battery life by considering the idle state of a BS, thereby increasing average delay and energy consumption, the proposed algorithm prolongs battery life by adjusting the initial and final states of a BS to minimize the average delay and the energy consumption. Similarly, the use of an omni-directional antenna to spread radio signals to the user equipment in all directions causes high interference and low spatial reuse. We propose using a directional antenna instead of an omni-directional antenna by transmitting signals in one direction which results in no or low interference and high spatial reuse. The proposed scheme has been extensively evaluated through simulation, where simulation results prove that the proposed scheme is efficiently able to decrease the average response delay, improve SE, and minimize energy consumption.Comment: 19 page